Study on university courses arrangement based on constraint satisfaction 基于約束滿足的高校排課問題研究
Efficient sequential pattern mining algorithm based on average value constraint satisfaction pruning strategy 基于均值約束滿足度剪枝策略的高效序列模式挖掘算法
The intelligent fixing test paper is a process of the problem of constraint satisfaction based on a typical relational database 摘要智能組卷是一個典型的基于關(guān)系數(shù)據(jù)庫多約束滿足的問題求解過程。
As with other engineering design , die design is , by its nature , a constraint satisfaction problem , how to tailor design space in accordance with constraints 冷沖模設(shè)計(jì)同其它工程設(shè)計(jì)一樣,本質(zhì)上是一個約束滿足問題,其實(shí)質(zhì)就是多個約束條件裁減設(shè)計(jì)空間。
For this reason , the thesis presents an approach based on constraint satisfaction , symbolic execution and extended finite state machines . it can analyze programs written in a subset of the c programming language 針對上述情況,本文中提出了一種方法,它基于約束滿足問題求解方法和擴(kuò)展有限狀態(tài)機(jī)上的符號執(zhí)行算法,能夠?qū)語言子集描述的程序進(jìn)行分析。
In artificial intelligence and operations research, constraint satisfaction is the process of finding a solution to a set of constraints that impose conditions that the variables must satisfy. A solution is therefore a vector of variables that satisfies all constraints.